منابع مشابه
Different-Distance Sets in a Graph
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...
متن کاملResolving Sets and Semi-Resolving Sets in Finite Projective Planes
In a graph Γ = (V,E) a vertex v is resolved by a vertex-set S = {v1, . . . , vn} if its (ordered) distance list with respect to S, (d(v, v1), . . . , d(v, vn)), is unique. A set A ⊂ V is resolved by S if all its elements are resolved by S. S is a resolving set in Γ if it resolves V . The metric dimension of Γ is the size of the smallest resolving set in it. In a bipartite graph a semi-resolving...
متن کاملThe Independent Resolving Number of a Graph
For an ordered set W = {w1, w2, . . . , wk} of vertices in a connected graph G and a vertex v of G, the code of v with respect to W is the k-vector cW (v) = (d(v, w1), d(v, w2), . . . , d(v, wk)). The setW is an independent resolving set for G if (1)W is independent in G and (2) distinct vertices have distinct codes with respect to W . The cardinality of a minimum independent resolving set in G...
متن کاملbiaccessibility in quadratic julia sets
در این رساله برای چندجمله ای های درجه ی دوم با مجموعه ی ژولیای همبند موضعی; ثابت خواهیم کرد: اندازه برولین مجموعه نقاط از دو سو دست یافتنی در چندجمله ای های درجه دو برابر با صفر است مگر چندجمله ای چبی شف که برابر با یک است. و برای چندجمله ای های درجه دوم با نقاط ثابت خنثی غیر گویا ثابت خواهیم کرد: 1)هر نقطه ی از دو سو دست یافتنی در حالت زیگل نهایتا به نقطه ی بحرانی و در حالت کرمر به نقطه ث...
Determining Sets, Resolving Sets, and the Exchange Property
A subset U of vertices of a graph G is called a determining set if every automorphism of G is uniquely determined by its action on the vertices of U . A subset W is called a resolving set if every vertex in G is uniquely determined by its distances to the vertices of W . Determining (resolving) sets are said to have the exchange property in G if whenever S and R are minimal determining (resolvi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2018
ISSN: 2073-8994
DOI: 10.3390/sym10100439